A Probabilistic Approach toward the Finite General Linear and Unitary Groups
نویسنده
چکیده
Abstract Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg’s count of unipotent elements, Rudvalis and Shindoda’s work on the fixed space of a random matrix, and Lusztig’s work on counting nilpotent matrices of a given rank.
منابع مشابه
A Probabilistic Approach toward Conjugacy Classes in the Finite General Linear and Unitary Groups
The conjugacy classes of the nite general linear and unitary groups are used to de ne probability measures on the set of all partitions of all natural numbers. Probabilistic algorithms for growing random partitions according to these measures are obtained. These algorithms are applied to prove group theoretic results which are typically proved by techniques such as character theory and Moebius ...
متن کاملOn Crdaha and Finite General Linear and Unitary Groups
We show a connection between Lusztig induction operators in finite general linear and unitary groups and parabolic induction in cyclotomic rational double affine Hecke algebras. Two applications are given: an explanation of a bijection result of Broué, Malle and Michel, and some results on modular decomposition numbers of finite general groups. 2010 AMS Subject Classification: 20C33 Dedicated t...
متن کاملOD-characterization of $U_3(9)$ and its group of automorphisms
Let $L = U_3(9)$ be the simple projective unitary group in dimension 3 over a field with 92 elements. In this article, we classify groups with the same order and degree pattern as an almost simple group related to $L$. Since $Aut(L)equiv Z_4$ hence almost simple groups related to $L$ are $L$, $L : 2$ or $L : 4$. In fact, we prove that $L$, $L : 2$ and $L : 4$ are OD-characterizable.
متن کاملDade’s Invariant Conjecture for General Linear and Unitary Groups in Non-defining Characteristics
This paper is part of a program to study the conjecture of E. C. Dade on counting characters in blocks for several finite groups. The invariant conjecture of Dade is proved for general linear and unitary groups when the characteristic of the modular representation is distinct from the defining characteristic of the groups.
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کامل